An Upper Bound on the Diameter of a Graph from Eigenvalues Associated with its Laplacian
نویسندگان
چکیده
The authors give a new upper bound for the diameter D(G) of a graph G in terms of the eigenvalues of the Laplacian of G. The bound is
منابع مشابه
A note on the bounds of Laplacian-energy-like-invariant
The Laplacian-energy-like of a simple connected graph G is defined as LEL:=LEL(G)=∑_(i=1)^n√(μ_i ), Where μ_1 (G)≥μ_2 (G)≥⋯≥μ_n (G)=0 are the Laplacian eigenvalues of the graph G. Some upper and lower bounds for LEL are presented in this note. Moreover, throughout this work, some results related to lower bound of spectral radius of graph are obtained using the term of ΔG as the num...
متن کاملLaplacian Sum-Eccentricity Energy of a Graph
We introduce the Laplacian sum-eccentricity matrix LS_e} of a graph G, and its Laplacian sum-eccentricity energy LS_eE=sum_{i=1}^n |eta_i|, where eta_i=zeta_i-frac{2m}{n} and where zeta_1,zeta_2,ldots,zeta_n are the eigenvalues of LS_e}. Upper bounds for LS_eE are obtained. A graph is said to be twinenergetic if sum_{i=1}^n |eta_i|=sum_{i=1}^n |zeta_i|. Conditions ...
متن کاملOn Relation between the Kirchhoff Index and Laplacian-Energy-Like Invariant of Graphs
Let G be a simple connected graph with n ≤ 2 vertices and m edges, and let μ1 ≥ μ2 ≥...≥μn-1 >μn=0 be its Laplacian eigenvalues. The Kirchhoff index and Laplacian-energy-like invariant (LEL) of graph G are defined as Kf(G)=nΣi=1n-1<...
متن کاملSome results on the energy of the minimum dominating distance signless Laplacian matrix assigned to graphs
Let G be a simple connected graph. The transmission of any vertex v of a graph G is defined as the sum of distances of a vertex v from all other vertices in a graph G. Then the distance signless Laplacian matrix of G is defined as D^{Q}(G)=D(G)+Tr(G), where D(G) denotes the distance matrix of graphs and Tr(G) is the diagonal matrix of vertex transmissions of G. For a given minimum dominating se...
متن کاملLaplacian Energy of a Fuzzy Graph
A concept related to the spectrum of a graph is that of energy. The energy E(G) of a graph G is equal to the sum of the absolute values of the eigenvalues of the adjacency matrix of G . The Laplacian energy of a graph G is equal to the sum of distances of the Laplacian eigenvalues of G and the average degree d(G) of G. In this paper we introduce the concept of Laplacian energy of fuzzy graphs. ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- SIAM J. Discrete Math.
دوره 7 شماره
صفحات -
تاریخ انتشار 1994